Handling Node Churn in Decentralized Network Coordinate System

نویسندگان

  • Yang Chen
  • Genyi Zhao
  • Ang Li
  • Beixing Deng
  • Xing Li
چکیده

Network coordinates (NC) system is an efficient mechanism to predict Internet distance with scalable measurements. In this paper, we focus on the node churn problem the continuous process of nodes arrival and departure in distributed applications. Studies on Vivaldi, a representative distributed NC system, shows that under node churn the prediction accuracy of the NC system will be seriously impaired. In this paper, we focus on how to handle the impact of node churn in Vivaldi. Firstly, we propose a simple solution by directly increasing the measurement frequency. Our experiments have demonstrated this approach can reduce the harm of node churn. However, it increases the communication overhead as the measurement frequency grows. To avoid such expensive solution, we propose the design and implementation of Myth, a decentralized and fast convergence NC system. It introduces the merit of Landmark-based NC system to shorten convergence time in Vivaldi with slight extra overhead. Our experimental results show that Myth outperforms Vivaldi a lot under node churn, without compromising the performance under stable environment. Moreover, we have found that use Myth is a cost-effective way to achieve higher prediction accuracy, it will not only improve the prediction accuracy but also save the communication overhead.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decentralized Network Coordinate System for Robust Internet Distance Prediction

Network coordinate systems have recently been developed as a scalable mechanism to predict latencies among arbitrary Internet hosts. Our research addresses several design challenges of a large-scale decentralized network coordinate system that were not fully addressed in prior work. In particular, we examine the design issues of a decentralized network coordinate system operating in a peer-to-p...

متن کامل

Handling node churn in decentralised network coordinate system

A Network Coordinate (NC) system is an efficient mechanism to predict Internet distance with scalable measurements. In this paper, we focus on the node churn problem – the continuous process of nodes arrival and departure – in distributed applications. Studies on Vivaldi, a representative distributed NC system, show that under node churn the prediction accuracy of the NC system will be seriousl...

متن کامل

Veracity: A Fully Decentralized Secure Network Coordinate Service

Decentralized network coordinate systems have been proposed as a means of efficiently estimating network distances among end-hosts over the Internet without having to contact them directly. These systems support a wide range of network services, including proximity-based routing, neighbor selection in overlays, and replica placement in content-distribution networks. Unfortunately, these systems...

متن کامل

Partition Tolerance and Data Consistency in Structured Overlay Networks

Structured overlay networks form amajor class of peer-to-peer systems, which are used to build scalable, fault-tolerant and selfmanagingdistributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. On the routing level, we provide algorithms for maintaining the structure of the overlay, and...

متن کامل

ElastO: Dynamic, Efficient, and Robust Maintenance of Low Fan-out Overlays for Topic-based Publish/Subscribe under Churn

We propose, ElastO, a distributed system for constructing and maintaining scalable churn-resistant overlay networks for topic-based publish/subscribe (pub/sub) systems. ElastO is designed to dynamically tread the balance among several key dimensions: (a) topic-connected overlay (TCO), i.e., the sub-overlay induced by nodes interested in any topic is connected, (b) low maximum and average node f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009